Fixed-parameter algorithms for the consensus analysis of genomic data
نویسنده
چکیده
منابع مشابه
A novel three-stage distance-based consensus ranking method
In this study, we propose a three-stage weighted sum method for identifying the group ranks of alternatives. In the first stage, a rank matrix, similar to the cross-efficiency matrix, is obtained by computing the individual rank position of each alternative based on importance weights. In the second stage, a secondary goal is defined to limit the vector of weights since the vector of weights ob...
متن کاملA Review on Consensus Algorithms in Blockchain
Block chain technology is a decentralized data storage structure based on a chain of data blocks that are related to each other. Block chain saves new blocks in the ledger without trusting intermediaries through a competitive or voting mechanism. Due to the chain structure or the graph between each block with its previous blocks, it is impossible to change blocking data. Block chain architectur...
متن کاملEconomic design of Hotelling’s T2 control chart on the presence of fixed sampling rate and exponentially assignable causes
Control charts are extensively used in manufacturing contexts to monitor production processes. This article illustrates economical design of a variable sample size and control limit Hotelling’s T2 control chart based on a novel cost model when occurrence times of the assignable causes are exponentially distributed. The proposed nonlinear cost model is an extension of Duncan’s (J Am Stat ...
متن کاملOptimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics
In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...
متن کاملFixed-parameter algorithms for some combinatorial problems in bioinformatics
NP-hard problems occur often in bioinformatics. The typical huge sizes of biological problem instances often prohibit solving NP-hard problems in bioinformatics optimally with classical approaches. Fixed-parameterized algorithmics has been developed in 1990s as a new approach to solve NP-hard problem optimally in a guaranteed running time. The essential idea of fixed-parameter algorithms is to ...
متن کامل